利用动态规划原理实现多冲量最优交会问题

多冲量最优交会问题是航天领域非常重要的一个研究方向,从运筹学角度将此问题转化为一个多阶段多维动态规划问题,并着重对多阶段二维动态规划进行分析研究。在给出状态方程及指标函数递推公式的基础上,得到了两冲量和三冲量交会问题最优解的求解算法,之后分别通过实例验证了算法的有效性。对于以地心角等参数为决策变量的更高维问题,讨论了利用进化算法等降维方法实现多维动态规划的思想。     

美国海军水面舰艇导弹防空体系分析

分析了美国海军防空作战思想,在此前提下总结出美海军舰空导弹体系主要的作战任务,说明了美海军典型水面舰艇装备舰空导弹的情况,最后阐述了今后美舰空导弹的发展趋势。     

动态教学法在《政治学原理》课程教学中的运用

政治学原理课程在授课过程中存在着教材内容的确定性和稳定性,而无论从国际国内形势还是从政治学研究而言,政治学所关注的范围和内容又都处于动态的不断发展变化的。笔者以为,只有在授课中具体运用动态教学法,通过联系学生自身、联系社会现实、联系国家大事、联系国际政治等实际,才能使政治学原理课程在马克思主义基本原则的指导下,更富有时代特征和生活气息,使学生真正学有所获。     

改革考试方法 加强考试管理

考试是评定学生学习成绩,检查教师教学效果和检测高校教学质量的基本手段,是教学管理中的重要环节。改革考试方法,加强考试管理,是教学管理部门和教师深入研究的重要课题。     

一种基于PDA滤波的多传感器管理算法

由于传感器资源或计算资源的限制,监视系统在跟踪多目标时通常不能同时为每个目标分配所有的传感器.因此,希望在满足目标跟踪性能的前提下尽可能使用较少的传感器.针对PDAF目标跟踪算法的特点,选用目标状态估计协方差的期望作为性能度量,提出了一种基于协方差控制的传感器算法.该算法通过为每个目标选择恰当的传感器组合来实现多传感器对多目标的分配.     

目标自动跟踪参数辨识模型的工程化动态辨识

为解决机动目标参数辨识模型工程应用问题,采用扩张状态观测器等先进的非线性滤波算法,从实测的含有观测噪声的目标位置数据的序列中,直接估计出机动目标运动的一阶、二阶、三阶导数,并结合目标运动模型辨识的理论算法,在工程应用上首次实现了机动目标运动模态和运动模型的双重动态辨识,完成了目标模型动态辨识的工程化设计.     

Inducing coordination in supply chains through linear reward schemes

Decentralized decision‐making in supply chain management is quite common, and often inevitable, due to the magnitude of the chain, its geographical dispersion, and the number of agents that play a role in it. But, decentralized decision‐making is known to result in inefficient Nash equilibrium outcomes, and optimal outcomes that maximize the sum of the utilities of all agents need not be Nash equilibria. In this paper we demonstrate through several examples of supply chain models how linear reward/penalty schemes can be implemented so that a given optimal solution becomes a Nash equilibrium. The examples represent both vertical and horizontal coordination issues. The techniques we employ build on a general framework for the use of linear reward/penalty schemes to induce stability in given optimal solutions and should be useful to other multi‐agent operations management settings. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Optimal pricing and inventory control policy in periodic‐review systems with fixed ordering cost and lost sales

This paper studies a periodic‐review pricing and inventory control problem for a retailer, which faces stochastic price‐sensitive demand, under quite general modeling assumptions. Any unsatisfied demand is lost, and any leftover inventory at the end of the finite selling horizon has a salvage value. The cost component for the retailer includes holding, shortage, and both variable and fixed ordering costs. The retailer's objective is to maximize its discounted expected profit over the selling horizon by dynamically deciding on the optimal pricing and replenishment policy for each period. We show that, under a mild assumption on the additive demand function, at the beginning of each period an (s,S) policy is optimal for replenishment, and the value of the optimal price depends on the inventory level after the replenishment decision has been done. Our numerical study also suggests that for a sufficiently long selling horizon, the optimal policy is almost stationary. Furthermore, the fixed ordering cost (K) plays a significant role in our modeling framework. Specifically, any increase in K results in lower s and higher S. On the other hand, the profit impact of dynamically changing the retail price, contrasted with a single fixed price throughout the selling horizon, also increases with K. We demonstrate that using the optimal policy values from a model with backordering of unmet demands as approximations in our model might result in significant profit penalty. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

A multilevel passenger screening problem for aviation security

Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Approximate dynamic programming methods for an inventory allocation problem under uncertainty

We propose two approximate dynamic programming methods to optimize the distribution operations of a company manufacturing a certain product at multiple production plants and shipping it to different customer locations for sale. We begin by formulating the problem as a dynamic program. Our first approximate dynamic programming method uses a linear approximation of the value function and computes the parameters of this approximation by using the linear programming representation of the dynamic program. Our second method relaxes the constraints that link the decisions for different production plants. Consequently, the dynamic program decomposes by the production plants. Computational experiments show that the proposed methods are computationally attractive, and in particular, the second method performs significantly better than standard benchmarks. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006